L-SHAPED DECOMPOSITION METHOD FOR MULTI-STAGE STOCHASTIC CONCENTRATOR LOCATION PROBLEM
نویسندگان
چکیده
منابع مشابه
L-shaped Decomposition Method for Multi-stage Stochastic Concentrator Location Problem
A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage intege...
متن کاملa bender’s decomposition algorithm for multi-objective hub location problem considering stochastic characteristics
in this paper, a multi-objective hub location problem considering stochastic links and candidate nodes characteristics is modeled. the first objective is to minimize total costs, including setup and transportation costs. the second one is to minimize network risks. characteristics such as weather conditions, safety, exchange rate, crisis, are defined as uncertainty parameters and considered as ...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کاملL-shaped decomposition of two-stage stochastic programs with integer recourse
We consider two-stage stochastic programming problems with integer recourse. The L-shaped method of stochastic linear programming is generalized to these problems by using generalized Benders decomposition. Nonlinear feasibility and optimality cuts are determined via general duality theory and can be generated when the second stage problem is solved by standard techniques. Finite convergence of...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2000
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.43.317